Enumeration on words, complexes and polytopes
نویسندگان
چکیده
This thesis presents four papers, studying enumerative problems on combinatorial structures. The first paper studies Forman’s discrete Morse theory in the case where a group acts on the underlying complex. We generalize the notion of a Morse matching, and obtain a theory that can be used to simplify the description of the G-homotopy type of a simplicial complex. The main motivation is the case where some group acts transitively on the vertex set of the complex, and G is some large subgroup of this group. In particular we are interested in complexes of graph properties. As an application, we determine the C2×Sn−2-homotopy type of the complex of non-connected graphs on n nodes. The motivation behind the second paper is Gil Kalai’s conjecture from 1989, that a centrally symmetric d-polytope must have at least 3 non-empty faces. Looking for examples that are close to achieving the lower bound, we study the centrally symmetric Hansen polytopes, associated to perfect graphs. In particular, we study Hansen polytopes of split graphs. Among them, we find an infinite family of polytopes with 3 +16 faces. We also prove that a Hansen polytope of a split graph has at least 3 non-empty faces. The third paper studies the problem of packing a pattern as densely as possible into compositions. We are able to find the packing density for some classes of generalized patterns and all the three letter binary patterns. In the fourth paper, we enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we consider fixed point λ-coloured permutations, which are easily enumerated. Several formulae regarding these numbers are given. We also prove that except in a trivial special case, the event that π has descents in a set S of positions is positively correlated with the event that π is a derangement, if π is chosen uniformly in Sn.
منابع مشابه
Type-Itemized Enumeration of RS-Stereoisomers of Octahedral Complexes
Stereoisograms of octahedral complexes are classified into five types (type I--typeV) under the action of the corresponding RS-stereoisomeric group. Their enumeration is accomplished in a type-itemized fashion, where Fujita's proligand method developed originally for combinatorial enumeration under point groups (S. Fujita, Theor. Chem. Acc., 113, 73--79 (2005)) is extended to meet the requireme...
متن کاملApproximate Verification and Enumeration Problems
We study enumeration problems using probabilistic methods, with application to verification problems. We consider the enumeration of monomials of a polynomial given as a black box, and the enumeration of discrete points which separate two polytopes in a space of dimension n, using a random walk which provides witnesses if the volume of the difference of the polytopes is large enough. The first ...
متن کاملSignable Posets and Partitionable Simplicial Complexes
The notion of a partitionable simplicial complex is extended to that of a signable partially ordered set. It is shown in a unified way that face lattices of shellable polytopal complexes, polyhedral cone fans, and oriented matroid polytopes, are all signable. Each of these classes, which are believed to be mutually incomparable, strictly contains the class of convex polytopes. A general suffici...
متن کاملOn the Face Lattice of the Metric Polytope
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration algorithms designed for general polytopes, tailor-made algorithms using their rich combinatorial features can exhibit strong performances. The main engine of these combinatorial algorithms is the use of the large sym...
متن کاملar X iv : m at h / 05 02 15 9 v 1 [ m at h . G T ] 8 F eb 2 00 5 POINT CONFIGURATIONS AND BLOW - UPS OF COXETER COMPLEXES
The minimal blow-ups of simplicial Coxeter complexes are natural generalizations of the real moduli space of Riemann spheres. They inherit a tiling by the graph-associahedra convex polytopes. We obtain configuration space models for these manifolds (of spherical and Euclidean Coxeter type) using particles on lines and circles. A (Fulton-MacPherson) compactification of these spaces is described ...
متن کامل